// url:https://codeforces.com/contest/1691/problem/E
// time:2022-05-31 19:25:06
// name:E-NumberofGroups

// #define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const multiset<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

template <class T> auto vect(const T& v, int n) { return vector<T>(n, v); }
template <class T, class... D> auto vect(const T& v, int n, D... m) {
  return vector<decltype(vect(v, m...))>(n, vect(v, m...));
}

using int64 = long long;
using int128 = __int128_t;
using ii = pair<int, int>;
#define SZ(x) (int)((x).size())
template <typename T> static constexpr T inf = numeric_limits<T>::max() / 2;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
// mt19937 mrand(random_device{}());
// int rnd(int x) { return mrand() % x; }
mt19937_64 mrand(random_device{}());
int64 rnd(int64 x) { return mrand() % x; }
int lg2(int64 x) { return sizeof(int64) * 8 - 1 - __builtin_clzll(x); }
template <class T> void out(const vector<T>& a) { for (int i = 0; i < SZ(a); ++i) cout << a[i] << " \n"[i + 1 == SZ(a)]; }
template <class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; }
template <class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
template <class T> void dedup(vector<T>& v) { sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); }
void add_mod(int& x, int y) { x += y; if (x >= MOD) x -= MOD; }
void sub_mod(int& x, int y) { x += MOD - y; if (x >= MOD) x -= MOD; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

template<size_t N>
struct SegmentTree {
  struct Node {
    Node *left, *right;
    int sum, delta;
    bool mark;
    void update(int a, int b, int c) {
      mark = 1;
      sum |= c;
      delta |= c;
    }
    void pushup() {
      sum = left->sum | right->sum;
    }
    void pushdown(int a, int b) {
      if (delta) {
        int mid = (a + b) / 2;
        left->update(a, mid, delta);
        right->update(mid, b, delta);
        delta = 0;
      }
    }
  };
  Node pool[N << 1], *last, *rt;
  int n;
  int f[3 * N], c[3 * N];
  int find(int x) {
    if (f[x] != f[f[x]]) f[x] = find(f[x]);
    return f[x];
  }
  bool join(int x, int y) {
    int rx = find(x), ry = find(y);
    if (rx == ry) return false;
    if (c[rx] < c[ry]) swap(rx, ry);
    f[ry] = rx;
    c[rx] += c[ry];
    return true;
  }
  SegmentTree(int n, int m): n(n) {
    last = pool;
    rt = build(0, n);
    for (int i = 0; i < 2 * n + m; ++i) f[i] = i, c[i] = 1;
  }
  Node* build(int a, int b) {
    Node* ret = last++;
    ret->sum = ret->delta = 0;
    ret->mark = 0;
    if (a + 1 == b) return ret;
    int mid = (a + b) / 2;
    ret->left = build(a, mid);
    ret->right = build(mid, b);
    return ret;
  }
  void insert(int ll, int rr, int64 c) { return insert(rt, 0, n, ll, rr, c); }
  void insert(Node* cur, int a, int b, int ll, int rr, int64 c) {
    if (ll >= rr || a >= rr || b <= ll) return;
    if (a >= ll && b <= rr) {
      cur->update(a, b, c);
      return;
    }
    cur->pushdown(a, b);
    int mid = (a + b) / 2;
    insert(cur->left, a, mid, ll, rr, c);
    insert(cur->right, mid, b, ll, rr, c);
    cur->pushup();
  }
  void query(int ll, int rr, int id) { return query(rt, 0, n, ll, rr, id); }
  void query(Node* cur, int a, int b, int ll, int rr, int id) {
    if (ll >= rr || a >= rr || b <= ll) return;
    if (a >= ll && b <= rr) {
      if (cur->sum == 3) {
        trace(id, a, b);
        join(cur - pool, id);
      }
      return;
    }
    cur->pushdown(a, b);
    int mid = (a + b) / 2;
    query(cur->left, a, mid, ll, rr, id);
    query(cur->right, mid, b, ll, rr, id);
  }
  void traverse(Node* cur, int a, int b) {
    if (a + 1 == b) return;
    int mid = (a + b) / 2;
    if (cur->mark) {
      if (cur->sum == 3 && cur->left->sum == 3) {
        join(cur - pool, cur->left - pool);
      }
      if (cur->sum == 3 && cur->right->sum == 3) {
        join(cur - pool, cur->right - pool);
      }
    }
    traverse(cur->left, a, mid);
    traverse(cur->right, mid, b);
  }
  int solve(int idL, int idR) {
    traverse(rt, 0, n);
    unordered_set<int> ret;
    for (int i = idL; i < idR; ++i) {
      ret.insert(find(i));
    }
    return SZ(ret);
  }
};

const int N = 2e5 + 10;
using segtree = SegmentTree<N>;

int main() {
  int cas;
  cin >> cas;
  while (cas--) {
    int n;
    cin >> n;
    vector<array<int, 3>> a(n);
    vector<int> pos;
    for (int i = 0; i < n; ++i) {
      cin >> a[i][0] >> a[i][1] >> a[i][2];
      a[i][2]++;
      pos.push_back(a[i][1]);
      pos.push_back(a[i][2]);
    }
    dedup(pos);
    int len = SZ(pos) - 1;
    segtree tr(len, n);
    trace(pos);
    for (auto& [c, L, R] : a) {
      L = lower_bound(pos.begin(), pos.end(), L) - pos.begin();
      R = lower_bound(pos.begin(), pos.end(), R) - pos.begin();
      tr.insert(L, R, 1 << c);
      trace(L, R, c);
    }
    int k = 0;
    for (auto& [c, L, R] : a) {
      tr.query(L, R, len * 2 + k);
      ++k;
    }
    int ret = tr.solve(len * 2, len * 2 + n);
    cout << ret << '\n';
  }

  return 0;
}

